Psychological Evidence for Assumptions of Path-Based Inheritance Reasoning
نویسندگان
چکیده
The psychological validity of inheritance reasoners is clarified. Elio and Pelletier (1993) presented the first pilot experiment exploring some of these issues. We investigate other foundational assumptions of inheritance reasoning with defaults: transitivity, blocking of transitivity by negative defaults, preemption in terms of structurally defined specificity and structurally defined redundancy of information. Responses were in accord with the assumption of at least limited transitivity, however, reasoning with negative information and structurally defined specificity conditions did not support the predictions of the literature. ‘Preemptive’ links were found to provide additional information leading to indeterminacy, rather than providing completely overriding information as the literature predicts. On the other hand, results support the structural identification of certain links as redundant. Other findings suggest that inheritance proof-theory might be excessively guided by
منابع مشابه
Human Reasoning with Negative Defaults
This paper examines psychological data on human reasoning with sets of negative defaults. A negative default is a statement of the form: Xs are typically not Ys. While there is pragmatic motivation for chaining positive defaults, chaining negative defaults (concluding from, As are typically not Bs and Bs are typically Cs that As are typically not Cs) is far less reasonable. Default inheritance ...
متن کاملSkeptical Inheritance: Computing the Intersection of Credulous Extensions
Ideally skeptical inheritance supports exactly those inferences true in every credulous extension of an inheritance hierarchy. We provide a formal definition of ideally skeptical inheritance. We show that two path-based approaches fail to capture ideally skeptical inheritance , and that there are inheritance hierarchies for which there are more always-true inferences than always-supported paths...
متن کاملINTEGRATING CASE-BASED REASONING, KNOWLEDGE-BASED APPROACH AND TSP ALGORITHM FOR MINIMUM TOUR FINDING
Imagine you have traveled to an unfamiliar city. Before you start your daily tour around the city, you need to know a good route. In Network Theory (NT), this is the traveling salesman problem (TSP). A dynamic programming algorithm is often used for solving this problem. However, when the road network of the city is very complicated and dense, which is usually the case, it will take too long fo...
متن کاملNon-Monotonic Inference Rules for the Credulous Theory
Most of the theories that model default reasoning by means of defeasible inheritance networks proceed via construction of paths, and are therefore known as `path-based'. In spite of many advantages, these theories also face certain well-known problems. In particular, they do poorly when cyclic nets are at issue or when it comes up to extensions. In this paper we show that these problems may be ...
متن کاملEstablishing an Argument-Based Validity Approach for a Low-Stake Test of Collocational Behavior
Most of the validation studies conducted across varying test application contexts are usually framed within the traditional conceptualization of validity and therefore lack a comprehensive framework to focus on test score interpretations and test score use. This study aimed at developing and validating a collocational behavior test (CBT), drawing on Kane's argument-based approach to validity. F...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009